chess revis acquir rule chess variant fol theori revis exampl htild scale relat decis tree larg databas bottom claus mode declar fol theori revis exampl advanc artifici intellig sbia genet local search rule learn combin attribut improv perform naiv bay regress bottom claus mode declar fol theori revis exampl improv natur crossov oper gbivil appli rec analysi ensembl particl filter appli rec analysi ensembl particl filter revis dorder logic theori exampl stochast local search improv model construct profil hmm remot homolog detect structur align studi structur properti profil hmm regress error characterist curv model select ensembl neural network regress error characterist curv model select ensembl neural network genet base machin learn merg pittsburgh michigan pfort revis probabilist fol theori appli rec analysi ensembl sigma dpoint kalman filter ilp proposition stochast dterm dnf learn ilp successfulli appli varieti task ilp system huge time storag requir ow larg search space claus clever search strategi need promis famili search strategi stochast local search method method successfulli appli proposit task satisfi substanti improv effici success method promis research direct emploi stochast local search ilp acceler runtim learn process investig direct recent perform ilp zelezn al stochast local search algorithm proposit satisfi benefit abil quickli test truth assign satisfi formula result solut assign test score short time contrast analog test ilp test claus cover take longer fewer solut test time motiv sucess limit previou work appli stochast local search ilp manner directli appli stochast local search space firstord horn claus proposition approach transform ilp task attribut learn task altern search space advantag fast test proposit satisfi primari aim paper reduc ilp run time standard greedi cover algorithm emploi ilp system shortcom typic ilp search guarante greedi cover yield global optim hypothesi greedi cover rise problem unnecessarili long hypothesi probabilist dorder theori revis exampl partit method fuzzi probabilist predictor improv perform rise algorithm abstract ideal multi strategi learn algorithm perform compon approach rise multi strategi algorithm combin rule induct instanc base learn achiev higher accuraci state art learn algorithm larg data set high averag run time work present analysi experiment evalu sunris multi strategi learn algorithm base rise sunris algorithm develop faster rise similar accuraci compar result experiment evalu algorithm verifi algorithm achiev compar accuraci rise algorithm lower averag run time search dbase class discret hidden markov model regress distribut design methodolog object dbm appli theori revis design distribut databas work present applic theori revis design distribut databas automat revis heurist base algorithm call analysi algorithm fort system analysi algorithm decid fragment techniqu class databas prolog implement provid initi domain theori fragment schema theori revis approach vertic fragment object orient databas fuzzi markov predictor dorder depend framework design distribut databas work present applic theori revis design distribut databas automat revis heurist base algorithm call analysi algorithm fort system analysi algorithm decid fragment techniqu class databas prolog implement provid initi domain theori fragment schema fuzzi bay fuzzi markov predictor learn logic program neural network object orient design expertis reus approach base heurist object orient oo languag guarante system connectionist induct learn logic program system connectionist induct learn logic program system il integr symbol connectionist paradigm artifici intellig neural network perform massiv parallel logic program induct learn exampl background knowledg work present extens il implement extend logic program neural network extens make il applic problem background knowledg repres default logic case appli system fault diagnosi simplifi power system gener plant obtain good preliminari result induct design distribut object orient databas cooper inform system ci consist applic access share resourc databas central system great impact system perform parallel distribut techniqu attain scalabl distribut databas crucial develop cooper applic order improv perform import design inform distribut properli goal distribut design difficulti embed design distribut object orient databas work present algorithm assist distribut design task analysi algorithm adequ fragment techniqu vertic horizont mix class databas schema propos machin learn method induct logic program uncov implicit issu consid distribut design hybrid model dorder theori refin penalti dfunction approach rule extract knowledg dbase neural network induc relat concept neural network linu system paper present method induc relat concept neural network induct logic program system linu order induct learn task machin learn literatur appli successfulli confirm qualiti hypothesi gener neural network normal program multipl predic learn goal direct reason semi dnormal default theori priorit contextu default logic cure anomal extens simpl abnorm default theori logic foundat modal defeas relev logic belief relev logic basi paraconsist epistem logic 